Genetic Algorithms for Randomized Unit Testing
نویسندگان
چکیده
منابع مشابه
Using a Genetic Algorithm to Control Randomized Unit Testing
Randomized testing has been shown to be an effective method for testing software units. However, the thoroughness of randomized unit testing varies widely according to the settings of certain parameters, such as the relative frequencies with which methods are called. In this paper, we describe a system which uses a genetic algorithm to find parameters for randomized unit testing that optimize t...
متن کاملOn Testing for Randomized Unit Root and Seasonal Unit Root
A lot of time series analysis in economics and nance is to determine whether a unit root and/or seasonal unit root is present in the data. These tests are usually based on unit root tests orginally developed by Dickey & Fuller(1981). Testing for the presence of a seasonal root has been considered by Dickey, Hasza & Fuller (1984). Li(1991) considered tests for the existence of a seasonal and a r...
متن کاملTwo Randomized Algorithms for Primality Testing
This algorithm was proposed in 70’s. Miller and Rabin gave two versions of the same algorithm to test whether a number n is prime or not. Whereas Rabin’s algorithm works with a randomly chosen a ∈ Zn, and is therefore a randomized one, Miller’s version tests deterministically for all a’s, where 1 ≤ a ≤ 4 log n. But correctness of Miller’s algorithm depends on correctness of Extended Riemann Hyp...
متن کاملOrthogonal Testing Using Genetic Algorithms
Orthogonal Array Testing is one of the most important techniques that produce test cases which are much lesser in number than black box testing, but are more relevant. In spite of its importance, the technique has not been explored as much as other techniques. The present work, therefore, explores the literature to find the gaps in the literature and hence propose a new technique based on Genet...
متن کاملShort Term Unit-Commitment Using Genetic Algorithms
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This paper discusses the application of genetic algorithms for determining short term commitment order of thermal units in power generation. The objective of the optimal commitment is to determine the on/oo states of the u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 2011
ISSN: 0098-5589
DOI: 10.1109/tse.2010.46